#include <bits/stdc++.h>
using namespace std;
const int N=100005;
int r[N];
int n;
int ans;
bool cmp(int a,int b)
{
    return a<b;
}
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>r[i];
    }
    sort(r+1,r+n+1,cmp);
    for (int i=1;i<=n;i++)
    {
        for (int j=i+1;j<=n;j++)
        {
            if (r[i]<r[j])
            {
                ans++;
                r[j]=0;
            }
        }
    }

    cout<<n-ans;
    return 0;
}
